A Note on Semi-bent Boolean Functions

نویسندگان

  • Claude Carlet
  • Sihem Mesnager
چکیده

We show how to construct semi-bent Boolean functions from PSaplike bent functions. We derive infinite classes of semi-bent functions in even dimension having multiple trace terms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on Semi-bent and Hyper-bent Boolean Functions

Boolean Function and Block Cipher A Note on Semi-bent and Hyper-bent Boolean Functions . . . . . . . . . . . . . . . 3 Chunming Tang, Yu Lou, Yanfeng Qi, Maozhi Xu, and Baoan Guo New Construction of Differentially 4-Uniform Bijections . . . . . . . . . . . . . . . 22 Claude Carlet, Deng Tang, Xiaohu Tang, and Qunying Liao Automatic Security Evaluation of Block Ciphers with S-bP Structures Again...

متن کامل

On generalized semi-bent (and partially bent) Boolean functions

In this paper, we obtain a characterization of generalized Boolean functions based on spectral analysis. We investigate a relationship between the Walsh-Hadamard spectrum and σ f , the sum-of-squares-modulus indicator (SSMI) of the generalized Boolean function. It is demonstrated that σ f = 22n+s for every s-plateaued generalized Boolean function in n variables. Two classes of generalized semi-...

متن کامل

Generalized Semi-bent and Partially Bent Boolean Functions

In this article, a relationship between the Walsh-Hadamard spectrum and σ f , the sum-of-squares-modulus indicator (SSMI) of the generalized Boolean function is presented. It is demonstrated for every s-plateaued generalized Boolean function in n variables that σ f = 22n+s. Two constructions on generalized semi-bent Boolean functions are presented. A class of generalized semi-bent functions in ...

متن کامل

Characterizations of o-polynomials by the Walsh transform

Abstract. The notion of o-polynomial comes from finite projective geometry. In 2011 and later, it has been shown that those objects play an important role in symmetric cryptography and coding theory to design bent Boolean functions, bent vectorial Boolean functions, semi-bent functions and to construct good linear codes. In this note, we characterize o-polynomials by the Walsh transform of the ...

متن کامل

A new class of semi-bent quadratic Boolean functions

In this paper, we present a new class of semi-bent quadratic Boolean functions of the form f(x) = ∑⌊m−1 2 ⌋ i=1 Tr n 1 (cix 1+4i) (ci ∈ F4,n = 2m). We first characterize the semi-bentness of these quadratic Boolean functions. There exists semi-bent functions only when m is odd. For the case: m = p, where p is an odd prime with some conditions, we enumerate the semi-bent functions. Further, we g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2010  شماره 

صفحات  -

تاریخ انتشار 2010